The Lanczos Algorithm and Pad E Approximations
نویسنده
چکیده
منابع مشابه
On Some Modiications of the Lanczos Algorithm and the Relation with Pad E Approximations
In this paper we try to show the relations between the Lanczos algorithm and Pad e approximations as used e.g. in identiication and model reduction of dynamical systems. 1
متن کاملE Approximation of Large - Scaledynamic Systems with Lanczos Methods
The utility of Lanczos methods for the approximation of large-scale dynamical systems is considered. In particular , it is shown that the Lanczos method is a technique for yielding Pad e approximants which has several advantages over more traditional explicit moment matching approaches. An extension of the Lanczos algorithm is developed for computing multi-point Pad e approximations of descript...
متن کاملAn Explicit Formula for Lanczos Polynomials*
The Lanczos algorithm for tridiagonalizing a given matrix A generates a sequence of approximating matrices A, that can naturally be obtained as restrictions to subspaces. The eigenvalues of these approximating matrices are well known to be good approximations to the extreme eigenvalues of A. In this paper we produce explicit formulas for the characteristic polynomials of the A,, in terms of the...
متن کاملAsymptotic Waveform Evaluation via aLanczos
|In this paper we show that the two-sided Lanczos procedure combined with implicit restarts ooers signiicant advantages over Pad e approximations used typically for model reduction in circuit simulation.
متن کاملcient Linear Circuit Analysis by Pad e Approximation via the Lanczos Process
This paper describes a highly e cient algorithm for the iterative computation of dominant poles and zeros of large linear networks. The algorithm is based on a new implementation of the Pad e approximation via the Lanczos process. This implementation has superior numerical properties, maintains the same computational e ciency as its predecessors, and provides a bound on the approximation error.
متن کامل